Proving Kneser’s theorem for finite groups by another $e$-transform
نویسندگان
چکیده
منابع مشابه
Another look at automated theorem-proving II
I continue the discussion initiated in [22] of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments. I examine some recent papers that describe automated security proofs for hashed ElGamal encryption, Boneh-Franklin identity-based encryption, and OAEP.
متن کاملE ective Theorem Proving for HardwareVeri cation ? ? ?
The attractiveness of using theorem provers for system design veriication lies in their generality. The major practical challenge confronting theorem proving technology is in combining this generality with an acceptable degree of automation. We describe an approach for enhancing the eeectiveness of theorem provers for hardware veriication through the use of eecient automatic procedures for rewr...
متن کاملFinite Quantification in Hierarchic Theorem Proving
Many applications of automated deduction require reasoning in firstorder logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are “reasonably complete” even in the presence of free function symbols ranging into a background theory sort. In this paper we consider the case when all variables occurrin...
متن کاملTheorem Proving with Bounded Rigid E-Unification
Rigid E -unification is the problem of unifying two expressions modulo a set of equations, with the assumption that every variable denotes exactly one term (rigid semantics). This form of unification was originally developed as an approach to integrate equational reasoning in tableau-like proof procedures, and studied extensively in the late 80s and 90s. However, the fact that simultaneous rigi...
متن کاملSuperposition Theorem Proving for Albelian Groups Represented as Integer Modules
We deene a superposition calculus specialized for abelian groups represented as integer modules, and show its refutational completeness. This allows to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Speciically, equational literals are simpliied, so that only the maximal term of the sums is on the left-hand side. Only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1974
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1974-0363940-2